m at h . FA ] 2 7 Ju l 2 00 4 APPROXIMATION BY ANALYTIC OPERATOR FUNCTIONS . FACTORIZATIONS AND VERY BADLY APPROXIMABLE FUNCTIONS
نویسندگان
چکیده
This is a continuation of our earlier paper [PT3]. We consider here operator-valued functions (or infinite matrix functions) on the unit circle T and study the problem of approximation by bounded analytic operator functions. We discuss thematic and canonical factorizations of operator functions and study badly approximable and very badly approximable operator functions. We obtain algebraic and geometric characterizations of badly approximable and very badly approximable operator functions. Note that there is an important difference between the case of finite matrix functions and the case of operator functions. Our criteria for a function to be very badly approximable in the case of finite matrix functions also guarantee that the zero function is the only superoptimal approximant. However in the case of operator functions this is not true.
منابع مشابه
Approximation by Analytic Operator Functions. Factorizations and Very Badly Approximable Functions
This is a continuation of our earlier paper published in Selecta Math. 11 (2005), 127–154. We consider here operator-valued functions (or infinite matrix functions) on the unit circle T and study the problem of approximation by bounded analytic operator functions. We discuss thematic and canonical factorizations of operator functions and study badly approximable and very badly approximable oper...
متن کاملMonotone thematic factorizations of matrix functions
We continue the study of the so-called thematic factorizations of admissible very badly approximable matrix functions. These factorizations were introduced by V.V. Peller and N.J. Young for studying superoptimal approximation by bounded analytic matrix functions. Even though thematic indices associated with a thematic factorization of an admissible very badly approximable matrix function are no...
متن کامل. FA ] 1 J an 2 00 1 On the determinant formulas by Borodin , Okounkov , Baik , Deift , and Rains
We give alternative proofs to (block case versions of) some formulas for Toeplitz and Fredholm determinants established recently by the authors of the title. Our proof of the Borodin-Okounkov formula is very short and direct. The proof of the Baik-Deift-Rains formulas is based on standard manipulations with Wiener-Hopf factorizations.
متن کاملRefined Enumeration of Minimal Transitive Factorizations of Permutations
Minimal transitive cycle factorizations, parking functions and labeled trees are related very closely. Using the correspondences between them, we find a refined enumeration of minimal transitive factorizations of permutations of type (1, n− 1) and (2, n− 2).
متن کاملTransitive cycle factorizations and prime parking functions
Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n − 1) and prime parking functions of length n.
متن کامل